ua nt - p h / 04 09 11 6 v 2 2 1 A pr 2 00 5 All Quantum Adversary Methods are Equivalent
نویسنده
چکیده
The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equal: spectral adversary [BSS03], weighted adversary [Amb03], strong weighted adversary [Zha04], and the Kolmogorov complexity adversary [LM04]. We also present a few new equivalent formulations of the method. This shows that there is essentially one quantum adversary method. From our approach, all known limitations of all versions of the quantum adversary method easily follow.
منابع مشابه
ar X iv : q ua nt - p h / 04 11 17 2 v 1 2 3 N ov 2 00 4 Information and Entropy in Quantum Theory
متن کامل
ua nt - p h / 04 11 09 8 v 1 1 5 N ov 2 00 4 A class of 2 N × 2 N bound entangled states revealed by non - decomposable maps
We use some general results regarding positive maps to exhibit examples of non-decomposable maps and 2 ×2N , N ≥ 2, bound entangled states, e.g. non distillable bipartite states of N+N qubits.
متن کاملar X iv : q ua nt - p h / 03 04 10 7 v 1 1 5 A pr 2 00 3 Distillable entanglement in d ⊗ d dimension
Distillable entanglement (E d) is one of the acceptable measures of entanglement of mixed states. Based on discrimination through local operation and classical communication, this paper gives E d for two classes of orthogonal multipartite maximally entangled states.
متن کاملua nt - p h / 02 04 04 8 v 1 9 A pr 2 00 2 1 General realization of N = 4 supersymmetric quantum mechanics and its applications
Dong Ruan∗ Department of Physics, Tsinghua University, Beijing 100084, P. R. China, Center of Theoretical Nuclear Physics, National Laboratory of Heavy Ion Accelerator, Lanzhou, 730000, P. R. China The Key Laboratory of Quantum Information and Measurements of Ministry of Education, Tsinghua University, Beijing 100084, P. R. China, and Weicheng Huang Institute of Applied Chemistry, Xingjiang Uni...
متن کاملua nt - p h / 01 04 09 1 v 3 2 6 A ug 2 00 1 Quantum mechanics gives stability to a Nash equilibrium
We consider a slightly modified version of the Rock-Scissors-Paper (RSP) game from the point of view of evolutionary stability. In its classical version the game has a mixed Nash equilibrium (NE) not stable against mutants. We find a quantized version of the RSP game for which the classical mixed NE becomes stable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005